PVT: An Efficient Computational Procedure to Speed up Next-generation Sequence Analysis

On Computational Speed-Up

Let J? be any effective mapping from total functions on the integers to total functions. Composition and iterated composition are examples of such mappings. The "operator speed-up theorem in this paper establishes the existence of a computable function f such that for any program computing f(x) in Pj(x) steps for all x, there is another program computing f(x) in p 0(x) steps and F(p 0) < palmos...

Using an Extended Suffix Tree to Speed-up Sequence Alignment

An important problem in computational biology is the alignment of a given query sequence and sequences in a database to find similar (locally or globally) sequences from the database to the query. Many heuristic algorithms for this problem are based on the idea of locating a fixed-length matching pair of substrings (called a seed) to start an alignment, and then extending this alignment using d...

Next Generation Sequence Analysis and Computational Genomics Using Graphical Pipeline Workflows

Whole-genome and exome sequencing have already proven to be essential and powerful methods to identify genes responsible for simple Mendelian inherited disorders. These methods can be applied to complex disorders as well, and have been adopted as one of the current mainstream approaches in population genetics. These achievements have been made possible by next generation sequencing (NGS) techno...

Next-Generation Head-up Displays

A mesh generation procedure to simulate bimaterials

It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...